Hybrid Tabu Search for Lot Sizing Problems
نویسندگان
چکیده
This paper presents a hybrid tabu search strategy for lot sizing problems. This strategy allows the exploitation of the quality of the well-known relax-and-fix heuristic, inside a tabu search framework which enforces diversity. The computational results show an advantage of this strategy when compared to a version of the relax-and-fix heuristic and to time constrained branch-and-bound.
منابع مشابه
A hybrid ant colony optimization algorithm to optimize capacitated lot-sizing problem
The economical determination of lot size with capacity constraints is a frequently complex, problem in the real world. In this paper, a multi-level problem of lotsizing with capacity constraints in a finite planning horizon is investigated. A combination of ant colony algorithm and a heuristic method called shifting technique is proposed for solving the problem. The parameters, including the co...
متن کاملMetaheuristic Approaches for the Multilevel Resource-Constrained lot-sizing Problem with setup and lead times
We propose the use of metaheuristics for the resource-capacitated multilevel lot-sizing problem with general product structures, setup costs, setup times, and lead times. Initially, we develop a heuristic which moves production in time in order to obtain feasible solutions with good quality. Strategies for the short-term memory and long-term memory of tabu search are then included to guide the ...
متن کاملMeta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search, genetic algorithms and simulated annealing, have become popular and efficient tools for solving hard combination...
متن کاملTabu Search for a Discrete Lot Sizing and Scheduling Problem
In this paper we consider a multi-item, multi-machine discrete lot sizing and scheduling problems (DLSP) which consists of finding a minimal cost production schedule over a finite discrete horizon, where in each period a machine may be either producing one item at full capacity or is idle. The demand for each item in each period is known, and can be satisfied either by production in the period,...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کامل